Grammar Specialisation Meets L
نویسنده
چکیده
CFG-based language models have become popular over the last few years, especially for commercial applications, and there is growing interest in creating complex CFG-based models for mixed initiative systems. On general grounds, it is attractive to attempt to compile these models from domain-independent descriptions written in high-level formalisms such as unification grammar. Experience to date however suggests that compilation from complex unification grammars to CFG has poor scalability properties. We argue that it is possible to attack this problem by first specialising the domain-independent grammar against a corpus using Explanation Based Learning. We describe experiments carried out on a medium vocabulary command and control task, which suggest that language models derived from specialised grammars have much better scalability properties, and also deliver significantly improved run-time performance.
منابع مشابه
Advanced Logic Program Specialisation
In first part of this course [28] we have laid the theoretical foundations for logic program specialisation, notably introducing the technique of partial deduction along with some basic techniques to automatically control it. In this part of the course we first present in Section 2 an advanced way of controlling polyvariance based upon characteristic trees. We then show in Section 3 how partial...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملTools for Grammar Engineering
Grammar writing is similar to programming in that grammars and programs must be tested and debugged until their input/output behaviour meets the given specifications and they run efficiently. Unlike programming, which can be approached by techniques like top-down refinement, modularization and so on, grammar writing is an incremental process, which consists of a cycle of • writing or modifying ...
متن کاملProgram analysis and specialisation using tree automata
Static analysis of programs using regular tree grammars has been studied for more than 30 years, the earliest example being Reynolds’ work on automatic derivation of data-type definitions from untyped functional programs. Recently the topic has attracted renewed attention, with applications in program specialisation, data flow analysis, shape analysis, mode and type inference, termination analy...
متن کاملA Generic Multi-Lingual Open Source Platform for Limited- Domain Medical Speech Translation
We present an overview of MedSLT, an Open Source platform for developing limited-domain medical speech translation systems. We focus in particular on the speech understanding architecture, which uses grammar-based language models derived using corpus-based specialisation methods from a single linguistically motivated grammar, and summarise the results of two evaluations which investigate the ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002